Characterization of solution sets of geodesic convex semi-infinite programming on Riemannian manifolds
نویسندگان
چکیده
منابع مشابه
Geodesic Connectedness of Semi-riemannian Manifolds
The problem of geodesic connectedness in semi-Riemannian manifolds (i.e. the question whether each two points of the manifold can be joined by a geodesic) has been widely studied from very different viewpoints. Our purpose is to review these semi-Riemannian techniques, and possible extensions. In the Riemannian case, it is natural to state this problem on (incomplete) manifolds with (possibly n...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملGeodesic Regression on Riemannian Manifolds
This paper introduces a regression method for modeling the relationship between a manifold-valued random variable and a real-valued independent parameter. The principle is to fit a geodesic curve, parameterized by the independent parameter, that best fits the data. Error in the model is evaluated as the sum-of-squared geodesic distances from the model to the data, and this provides an intrinsic...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملOn duality theory of convex semi-infinite programming
where is a (possibly infinite) set, f : R ! R is an extended real valued function and g : R ! R. In the above formulation, a feasible point x 2 R is supposed to satisfy the constraints gðx,!Þ 0 for all !2 , and no structural assumptions are made about the set . In some situations it is natural to require that these constraints hold for almost every (a.e.) !2 . That is, the set is equipped with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied set-valued analysis and optimization
سال: 2023
ISSN: ['2562-7775', '2562-7783']
DOI: https://doi.org/10.23952/asvao.5.2023.1.01